On simultaneous approximation and interpolation which preserves the norm
نویسندگان
چکیده
منابع مشابه
Simultaneous Approximation and Interpolation of Functions on Continua in the Complex Plane
We construct polynomial approximations of Dzjadyk type (in terms of the k -th modulus of continuity, k ≥ 1 ) for analytic functions defined on a continuum E in the complex plane, which simultaneously interpolate at given points of E . Furthermore, the error in this approximation is decaying as e−cn α strictly inside E , where c and α are positive constants independent of the degree n of the app...
متن کاملA Transformation Which Preserves the Clique Number
We introduce a graph transformation which preserves the clique number. When applied to graphs containing no odd hole and no cricket (a particular graph on 5 vertices) the transformation also preserves the chromatic number. Using this transformation we derive a polynomial algorithm for the computation of the clique number of all graphs in a class which strictly contains diamond-free graphs. Furt...
متن کاملMinimum Sobolev norm interpolation with trigonometric polynomials on the torus
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Multivariate interpolation Uniformly bounded interpolatory operators Minimum Sobolev norm interpolation Localized ...
متن کاملMultilevel Interpolation and Approximation
Interpolation by translates of a given radial basis function (RBF) has become a well-recognized means of tting functions sampled at scattered sites in R d. A major drawback of these methods is their inability to interpolate very large data sets in a numerically stable way while maintaining a good t. To circumvent this problem, a multilevel interpolation (ML) method for scattered data was presen...
متن کاملDiscrepancy norm: Approximation and variations
This paper introduces an approach for the minimization of the discrepancy norm. The general idea is to replace the infinity norms appearing in the definition by L norms which are differentiable and to make use of this approximation for local optimization. We will show that the discrepancy norm can be approximated up to any ε and the robustness of this approximation is shown. Moreover, analytica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1969
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1969-12305-0